@article{hinzeArray,
 author = {Hinze, Ralf},
 title = {Bootstrapping one-sided flexible arrays},
 journal = {SIGPLAN Not.},
 volume = {37},
 number = {9},
 year = {2002},
 issn = {0362-1340},
 pages = {2--13},
 doi = {http://doi.acm.org/10.1145/583852.581480},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@misc{website,
  title = {Random access streams},
  subtitle = {Infinite lists in Haskell with quick access to elements by index},
  author = {Jim Apple},
  howpublished = {\url{http://code.google.com/p/random-access-streams/}} 
} 


@Manual{coq,
  title =        {The Coq proof assistant reference manual},
  author =       {\mbox{The Coq development team}},
  organization = {LogiCal Project},
  note =         {Version 8.0},
  year =         {2004},
  url =          "http://coq.inria.fr"
}

@article{edison,
  author    = {Chris Okasaki},
  title     = {An Overview of {Edison}},
  journal   = {Electr. Notes Theor. Comput. Sci.},
  volume    = {41},
  number    = {1},
  year      = {2000},
  ee        = {http://www.elsevier.com/gej-ng/31/29/23/76/33/show/Products/notes/index.htt\#005},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{artin,
  title = {Artin's conjecture for primitive roots},
  author = {M. Ram Murty},
  journal = {The Mathematical Intelligencer},
  publisher = {Springer New York},
  issn = {0343-6993 (Print) 1866-7414 (Online)},
  url = {http://www.springerlink.com/content/m7758656374364h1/},
  abstract = {Without Abstract},
  number = {4},
  pages = {59--67},
  volume = {10},
  doi = {10.1007/BF03023749},
  year = {1988},
  month = {December},
  subject_collection = {Mathematics and Statistics},
}

@book{haskellReport,
    author = {Jones, Simon P.},
    day = {05},
    howpublished = {Hardcover},
    isbn = {0521826144},
    keywords = {haskell},
    month = {May},
    posted-at = {2007-09-11 03:11:57},
    priority = {2},
    publisher = {{Cambridge University Press}},
    title = {Haskell 98 Language and Libraries: The Revised Report},
    year = {2003}
}

@MastersThesis{holtersThesis,
    author = {Martin Holters},
    title = {Efficient Data Structures in a Lazy Functional Language},
    year = {2003},
    school = {Chalmers University of Technology},
}
@PhdThesis{okasakiThesis,
    author     =     {Chris Okasaki},
    title     =     {Purely Functional Data Structures},
    school     =     {Carnegie Mellon University},
    address     =     {Pittsburgh, PA, USA},
    year     =     {1996},
month = {September},
isbn = { 0-591-64723-0},
}

@inproceedings{okasakiSkewLists,
  author    = {Chris Okasaki},
  title     = {Purely Functional Random-Access Lists},
  booktitle = {FPCA},
  year      = {1995},
  pages     = {86-95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{okasakiBraun,
  author    = {Chris Okasaki},
  title     = {Three Algorithms on {Braun} Trees},
  journal   = {J. Funct. Program.},
  volume    = {7},
  number    = {6},
  year      = {1997},
  pages     = {661-666},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{hoogerwoord,
  author    = {Rob R. Hoogerwoord},
  title     = {A Logarithmic Implementation of Flexible Arrays},
  booktitle = {MPC},
  year      = {1992},
  pages     = {191-207},
  crossref  = {DBLP:conf/mpc/1992},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/mpc/1992,
  editor    = {Richard S. Bird and
               Carroll Morgan and
               Jim Woodcock},
  title     = {Mathematics of Program Construction, Second International
               Conference, Oxford, U.K., June 29 - July 3, 1992, Proceedings},
  booktitle = {MPC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {669},
  year      = {1993},
  isbn      = {3-540-56625-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{dielissen,
  author    = {Victor J. Dielissen and
               Anne Kaldewaij},
  title     = {A Simple, Efficient, and Flexible Implementation of Flexible
               Arrays},
  booktitle = {MPC},
  year      = {1995},
  pages     = {232-241},
  crossref  = {DBLP:conf/mpc/1995},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/mpc/1995,
  editor    = {Bernhard M{\"o}ller},
  title     = {Mathematics of Program Construction, MPC'95, Kloster Irsee,
               Germany, July 17-21, 1995, Proceedings},
  booktitle = {MPC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {947},
  year      = {1995},
  isbn      = {3-540-60117-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{kaplan96purely,
 author = {Haim Kaplan and Robert E. Tarjan},
 title = {Purely functional representations of catenable sorted
   lists},
 booktitle = {STOC '96: Proc. 28th ACM
   {Symposium on Theory of Computing}},
 year = {1996},
 isbn = {0-89791-785-5},
 pages = {202--211},
 publisher = {ACM},
}

@article{HinzePat,
title={Finger Trees: A Simple General-purpose Data
Structure},
author = {Ralf Hinze and Ross Paterson},
journal={Journal of Functional Programming},
volume = {16},
number = {2}, 
year = {2006}, 
pages={ 197--217},
}

@article{BrownTarjan,
author    = {Mark R. Brown and Robert Endre Tarjan},
title     = {A Fast Merging Algorithm},
journal   = {J. ACM},
volume    = {26},
number    = {2},
year      = {1979},
pages     = {211--226},
}